Automatic Performance Tuning of Sparse Matrix Kernels
نویسندگان
چکیده
Automatic Performance Tuning of Sparse Matrix Kernels
منابع مشابه
Generators for Automatic Tuningof Numerical Kernels : Experiences with FFTWPosition
Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning by hand. In response, a number automatic tuning systems have been developed which typically operate by (1) generating multiple implementations of a kernel, and (2) empirically selecting an optimal implementation. One ...
متن کاملCode Generators for Automatic Tuningof Numerical Kernels : Experiences with FFTWPosition
Achieving peak performance in important numerical kernels such as dense matrix multiply or sparse-matrix vector multiplication usually requires extensive, machine-dependent tuning by hand. In response, a number automatic tuning systems have been developed which typically operate by (1) generating multiple implementations of a kernel, and (2) empirically selecting an optimal implementation. One ...
متن کاملOSKI: A library of automatically tuned sparse matrix kernels
The Optimized Sparse Kernel Interface (OSKI) is a collection of low-level primitives that provide automatically tuned computational kernels on sparse matrices, for use by solver libraries and applications. These kernels include sparse matrix-vector multiply and sparse triangular solve, among others. The primary aim of this interface is to hide the complex decisionmaking process needed to tune t...
متن کاملCAS WAVELET METHOD FOR THE NUMERICAL SOLUTION OF BOUNDARY INTEGRAL EQUATIONS WITH LOGARITHMIC SINGULAR KERNELS
In this paper, we present a computational method for solving boundary integral equations with loga-rithmic singular kernels which occur as reformulations of a boundary value problem for the Laplacian equation. Themethod is based on the use of the Galerkin method with CAS wavelets constructed on the unit interval as basis.This approach utilizes the non-uniform Gauss-Legendre quadrature rule for ...
متن کاملMethods of Parallel Experimental Design of Online Automatic Tuning and their Application to Parallel Sparse Matrix Data Structure
Automatic tuning is one of key technologies in high performance computing, where parallel processing is essential. In this paper, we propose some methods of parallel experimental design for online automatic tuning of parallel programs. In parallel processing, two kinds of tuning should be investigated. One is local tuning, which optimizes local tuning parameters on each processor, and the other...
متن کامل